Journals
  Publication Years
  Keywords
Search within results Open Search
Please wait a minute...
For Selected: Toggle Thumbnails
News recommendation model with deep feature fusion injecting attention mechanism
Yuxi LIU, Yuqi LIU, Zonglin ZHANG, Zhihua WEI, Ran MIAO
Journal of Computer Applications    2022, 42 (2): 426-432.   DOI: 10.11772/j.issn.1001-9081.2021050907
Abstract578)   HTML55)    PDF (755KB)(256)       Save

When mining news features and user features, the existing news recommendation models often lack comprehensiveness since they often fail to consider the relationship between the browsed news, the change of time series, and the importance of different news to users. At the same time, the existing models also have shortcomings in more fine-grained content feature mining. Therefore, a news recommendation model with deep feature fusion injecting attention mechanism was constructed, which can comprehensively and non-redundantly conduct user characterization and extract the features of more fine-grained news fragments. Firstly, a deep learning-based method was used to deeply extract the feature matrix of news text through the Convolutional Neural Network (CNN) injecting attention mechanism. By adding time series prediction to the news that users had browsed and injecting multi-head self-attention mechanism, the interest characteristics of users were extracted. Finally, a real Chinese dataset and English dataset were used to carry out experiments with convergence time, Mean Reciprocal Rank (MRR) and normalized Discounted Cumulative Gain (nDCG) as indicators. Compared with Neural news Recommendation with Multi-head Self-attention (NRMS) and other models, on the Chinese dataset, the proposed model has the average improvement rate of nDCG from -0.22% to 4.91% and MRR from -0.82% to 3.48%. Compared with the only model with negative improvement rate, the proposed model has the convergence time reduced by 7.63%. on the English dataset, the proposed model has the improvement rates reached 0.07% to 1.75% and 0.03% to 1.30% respectively on nDCG and MRR; At the same time this model always has fast convergence speed. Results of ablation experiments show that adding attention mechanism and time series prediction module is effective.

Table and Figures | Reference | Related Articles | Metrics
Application of 3DPCANet in image classification of functional magnetic resonance imaging for Alzheimer’s disease
Hongfei JIA, Xi LIU, Yu WANG, Hongbing XIAO, Suxia XING
Journal of Computer Applications    2022, 42 (1): 310-315.   DOI: 10.11772/j.issn.1001-9081.2021010132
Abstract321)   HTML11)    PDF (568KB)(104)       Save

Alzheimer’s Disease (AD) is a progressive neurodegenerative disease with hidden causes, and can result in structural changes of patients’ brain regions. For assisting the doctors to make correct judgment on the condition of AD patients, an improved Three-Dimensional Principal Component Analysis Network (3DPCANet) model was proposed to classify AD by combining the mean Amplitude of Low-Frequency Fluctuation (mALFF) image of the whole brain of the subject. Firstly, functional Magnetic Resonance Imaging (fMRI) data were preprocessed, and the mALFF image of the whole brain was calculated. Then, the improved 3DPCANet deep learning model was used for feature extraction. Finally, Support Vector Machine (SVM) was used to classify features of AD patients with different stages. Experimental results show that the proposed model is simple and robust, and has the classification accuracies on Subjective Memory Decline (SMD) vs. AD, SMD vs. Late Mild Cognitive Impairment (LMCI), and LMCI vs. AD reached 92.42%, 91.80% and 89.33% respectively, which verifies the effectiveness and feasibility of the proposed method.

Table and Figures | Reference | Related Articles | Metrics
Hybrid genetic algorithm based on two-dimensional variable neighborhood coding
ZHU Biying ZHU Fuxi LIU Kegang LI Fanchen
Journal of Computer Applications    2014, 34 (9): 2537-2542.   DOI: 10.11772/j.issn.1001-9081.2014.09.2537
Abstract273)      PDF (905KB)(329)       Save

Concerning that the general hybrid genetic algorithms cannot give attention to both effectiveness and efficiency, a new hybrid genetic algorithm using two-dimensional variable neighborhood coding named VNHGA was proposed. Firstly, the traditional binary coding method was replaced by a new coding method, which was designed to separate coding and synchronous inheritance for individuals. Secondly, the traditional mutation operator was replaced by a new stable mutation operator to improve efficiency. VNHGA was tested by optimization problem of multi-dimensional functions. It was verified that, after adopting the new coding method, features with more effectiveness and less efficiency were maintained when using "Baldwin effect" relative to using "Lamarckian evolution" as embedding strategy. After introducing the stable mutation operator, effectiveness was maintained and efficiency was improved at the same time, and the running time was shortened about half of before. VNHGA was also compared with other two modified hybrid genetic algorithms to exhibit its advantages. The results indicate that VNHGA is both effective and efficient, and it can be used to solve optimization problems.

Reference | Related Articles | Metrics
Route choice model and algorithm under restriction of multi-source traffic information
GUO Hongxiang ZHANG Xi LIU Lan LIU Xuhai YAN Kai
Journal of Computer Applications    2014, 34 (7): 2093-2098.   DOI: 10.11772/j.issn.1001-9081.2014.07.2093
Abstract129)      PDF (888KB)(367)       Save

To the shortage of theoretical support in the policy-making process of traffic guidance management, the research method of choice behavior with confinement mechanism of traffic information was proposed. From the perspective of human perception, the deep analysis of Multi-Source Traffic Information (MSTI) constraint rule was presented based on fuzzy clustering algorithm, then the road network environment was simulated by VISSIM and the traffic state pattern recognition model was established to simulate the mental activity of traveler under restriction of information. Then by means of Biogeme software, the choice model was constructed based on the behavior survey data, which was obtained in the road network example by using Stated Preference (SP) investigate method. Results show that the sanction of traffic information on travel behavior is very limited and the travelers prefer the preference path when traffic of this preference path is not very heavy, while this sanction enhances gradually and the path change behavior, which is influenced by the information, becomes more frequent when the preference path is more congested. The conclusions provided a new idea and reference for incomplete rational behavior research under the information environment, and also provided decision support for traffic management department.

Reference | Related Articles | Metrics
Delay tolerant network routing resource allocation model on general k-anycast
ZHANG Yong-hui LIN Zhang-xi LIU Jian-hua LIANG Quan
Journal of Computer Applications    2012, 32 (12): 3494-3498.   DOI: 10.3724/SP.J.1087.2012.03494
Abstract745)      PDF (995KB)(445)       Save
Delay Tolerant Network (DTN) can modify frequent network disruption and segmentation in mobile Internet access. Its core technology includes routing resource allocation. However, the existed knowledge oracles of DTN routing algorithms are time probabilistic uncertainty in public transport means mobile network or logistics, which reduces the efficiency of resource allocation. So it was proposed that general k-anycast allocates bandwidth resources to k eligible access routers in access period, which diversify the time deviation degrees and decrease the uncertainty. And access router information matrixes decide general k-anycast router aggregation. Therefore packets can be transmitted simultaneously to multiple destinations. The probabilistic uncertain utility model was further proposed for routing resource allocation based on DTN custody transfer. Simulations show that its transmission performance and robustness are better than Multicast DTN routing algorithm.
Related Articles | Metrics
Improved least mean square adaptive filter algorithm
WANG Cheng-xi LIU Yi-an ZHANG Qiang
Journal of Computer Applications    2012, 32 (07): 2078-2081.   DOI: 10.3724/SP.J.1087.2012.02078
Abstract1042)      PDF (629KB)(689)       Save
Concerning the contradiction between convergence speed and convergence precision when the traditional fixed pace Least Mean Square (LMS) algorithm was used to radar clutter adaptive filter system, the paper put forward a new kind of variable-pace adaptive filter algorithm. Through combining the relevant error and the former pace to real-time update next iteration of the pace in its basic pace iterative formula, which could reach with higher convergence speed and smaller disorder, and it also could prevent the bad effect from the existing related noise. The simulation results show that, compared with the traditional fixed-pace LMS algorithm and context improved algorithm, the convergence rate, convergence accuracy and noise prevention have been greatly improved. It proves that the proposed algorithm is effective, feasible, and consistent with the theoretical analysis.
Reference | Related Articles | Metrics